Skip to content

Conversation

nandikeshsingh
Copy link
Contributor

ISSUE NUMBER

#265

SHORT DESCRIPTION

Code to find the longest bitonic subsequence in C++ using dynamic programming.

TESTING

Some inputs with their correct outputs.

Input:-
8
1 11 2 10 4 5 2 1
Output:-
6

Input:-
6
12 11 40 5 3 1
Output:-
5

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant